The random minimal spanning tree in high dimensions
نویسندگان
چکیده
منابع مشابه
On the bicriterion - minimal cost/minimal label - spanning tree problem
We deal with a bicriterion spanning tree problem relevant in some application fields such as telecommunication networks or electric networks. Each edge is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the spanning tree (the summation of its edge costs), while the second intends to get the solution with a minimum number of dif...
متن کاملUniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (standardized) edge length in the MST of the given data. Large lengths indicate the existence of well-separated clusters or outliers in the data. For the data passing this edge inconsistency test, we generate two sub-sample...
متن کاملA Fully Distributed (Minimal) Spanning Tree Algorithm
In this paper, we consider a connected undirected graph with n nodes. An asynchronous dist r ibuted algori thm is described which determines a spanning tree of the graph. Moreover, if the edges of the graph are weighted, the same algorithm can compute a minimum-weighted spanning tree. This algori thm can be favourably compared to the one of Gallagher et al. [6] in the following way: identical a...
متن کاملOn the total length of the random minimal directed spanning tree
In Bhatt and Roy’s minimal directed spanning tree (MDST) construction for a random partially ordered set of points in the unit square, all edges must respect the “coordinatewise” partial order and there must be a directed path from each vertex to a minimal element. We study the asymptotic behaviour of the total length of this graph with power weighted edges. The limiting distribution is given b...
متن کاملScaling limits for minimal and random spanning trees in two dimensions
A general formulation is presented for continuum scaling limits of stochastic spanning trees. Tightness of the distribution, as δ → 0, is established for the following twodimensional examples: the uniformly random spanning tree on δZ2, the minimal spanning tree on δZ2 (with random edge lengths), and the Euclidean minimal spanning tree on a Poisson process of points in R2 with density δ−2. A con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1996
ISSN: 0091-1798
DOI: 10.1214/aop/1041903210